Similarity Graphs
نویسندگان
چکیده
The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the issue here is conceptual resemblance. The basis is a knowledge base defining major concepts of the domain and may include taxonomic and ontological domain knowledge. The challenge for support of queries in this context is an evaluation principle that on the one hand respects the formation rules for concepts in the concept language and on the other is sufficiently efficient to candidate as a realistic principle for query evaluation. We present and discuss principles where efficiency is obtained by reducing the matching problem which basically is a matter of conceptual reasoning to numerical similarity computation.
منابع مشابه
Computing Simulations on Finite and Infinite Graphs
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m 2 n). For effectively presented infinite graphs, we present a symbolic similarity-check...
متن کاملSimulations on Finite and In nite Graphs yMonika
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the reenement and veriication of reactive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For eeectively presented innnite graphs, we present a symbolic similarity-checking proc...
متن کاملComputing Simulations on Finite and In nite Graphs
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the reenement and veriication of reac-tive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For effectively presented innnite graphs, we present a symbolic similarity-checking pr...
متن کاملComputing Simulations on Finite and In nite Graphs y
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the re nement and veri cation of reactive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For e ectively presented in nite graphs, we present a symbolic similarity-checking proc...
متن کاملSimilarity Search in Structured Data
Recently, structured data is getting more and more important in database applications, such as molecular biology, image retrieval or XML document retrieval. Attributed graphs are a natural model for the structured data in those applications. For the clustering and classification of such structured data, a similarity measure for attributed graphs is necessary. All known similarity measures for a...
متن کاملRecent Developments in Graph Matching
Graphs are a powerful and versatile tool useful in various subfields of science and engineering. In many applications, for example, in pattern recognition and computer vision, it is required to measure the similarity of objects. When graphs are used for the representation of structured objects, then the problem of measuring object similarity turns into the problem of computing the similarity of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003